منابع مشابه
Square form factorization
We present a detailed analysis of SQUFOF, Daniel Shanks’ Square Form Factorization algorithm. We give the average time and space requirements for SQUFOF. We analyze the effect of multipliers, either used for a single factorization or when racing the algorithm in parallel.
متن کاملDaniel Shanks’ Square Forms Factorization
The problem of distinguishing prime numbers from composite numbers and of resolving the latter into their prime factors is known to be one of the most important and useful in arithmetic. It has engaged the industry and wisdom of ancient and modern geometers ... the dignity of the science itself seems to require that every possible means be explored for the solution of a problem so elegant and s...
متن کاملPion Form Factors with Improved Infrared Factorization
We calculate electromagnetic pion form factors with an analytic model for αs(Q 2) which is infrared (IR) finite. We show that for the asymptotic pion distribution amplitude Fπ0γ∗γ agrees with the data, whereas the IR-enhanced hard contribution to Fπ and the soft part can jointly account for the data. 12.38.Bx, 12.38.Cy, 12.38.Lg, 13.40.Gp Typeset using REVTEX ∗Email: [email protected]...
متن کاملHeavy - heavy form factors and generalized factorization
We reanalyze B ! D and B ! KJ= data to extract a set of parameters which give the relevant hadronic matrix elements in terms of factorized amplitudes. Various sources of theoretical uncertainties are studied, in particular those depending on the model adopted for the form factors. We nd that the t to the B ! D branching ratios substantially depends on the model describing the Isgur-Wise functio...
متن کاملA Projected Alternating Least square Approach for Computation of Nonnegative Matrix Factorization
Nonnegative matrix factorization (NMF) is a common method in data mining that have been used in different applications as a dimension reduction, classification or clustering method. Methods in alternating least square (ALS) approach usually used to solve this non-convex minimization problem. At each step of ALS algorithms two convex least square problems should be solved, which causes high com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2008
ISSN: 0025-5718,1088-6842
DOI: 10.1090/s0025-5718-07-02010-8